Hyperplane Arrangements and Linear Strands in Resolutions
نویسنده
چکیده
The cohomology ring of the complement of a central complex hyperplane arrangement is the well-studied Orlik-Solomon algebra. The homotopy group of the complement is interesting, complicated, and few results are known about it. We study the ranks for the lower central series of such a homotopy group via the linear strand of the minimal free resolution of the field C over the Orlik-Solomon algebra.
منابع مشابه
Syzygies of Oriented Matroids
We construct minimal cellular resolutions of squarefree monomial ideals arising from hyperplane arrangements, matroids, and oriented matroids. These are StanleyReisner ideals of complexes of independent sets and of triangulations of Lawrence matroid polytopes. Our resolution provides a cellular realization of R. Stanley’s formula for their Betti numbers. For unimodular matroids our resolutions ...
متن کاملLower Central Series and Free Resolutions of Hyperplane Arrangements
If M is the complement of a hyperplane arrangement, and A = H(M, k) is the cohomology ring of M over a field of characteristic 0, then the ranks, φk, of the lower central series quotients of π1(M) can be computed from the Betti numbers, bii = dimTor A i (k, k)i, of the linear strand in a minimal free resolution of k over A. We use the Cartan-Eilenberg change of rings spectral sequence to relate...
متن کاملOn Generators of the Module of Logarithmic 1-Forms with Poles Along an Arrangement
For each element X of codimension two of the intersection lattice of a hyperplane arrangement we define a differential logarithmic 1-forms tax with poles along the arrangement. Then we describe the class of arrangements for which forms wX generate the whole module of the logarithmic 1-forms with poles along the arrangement. The description is done in terms of linear relations among the function...
متن کاملFrom Linear Codes to Hyperplane Arrangements via Thomas Decomposition
We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight enumerator of a linear code. In particular, one can deal with infinitely many finite fields simultaneously by defining a weight enumerator for codes over infinite fi...
متن کاملResearch: Past and Present
Figure 1: A line arrangement in the plane The study of configurations of lines in the plane or planes in space has a relatively short history. Some say the field arose from the cheese cutting problem: what is the maximum number of pieces one can produce from a fixed number of cuts? Others say that it arose through the history of braid groups: the pure braid group on n strands turns out to be th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997